From rewrite rules to bisimulation congruences
نویسندگان
چکیده
منابع مشابه
From rewrite rules to bisimulation congruences
The dynamics of many calculi can be most clearly defined by a reduction semantics. To work with a calculus, however, an understanding of operational congruences is fundamental; these can often be given tractable definitions or characterisations using a labelled transition semantics. This paper considers calculi with arbitrary reduction semantics of three simple classes, firstly ground term rewr...
متن کاملFrom Rewrite Rules to Bisimulation Congruen es
The dynami s of many al uli an be most learly de ned by a redu tion semanti s. To work with a al ulus, however, an understanding of operational ongruen es is fundamental; these an often be given tra table de nitions or hara terisations using a labelled transition semanti s. This paper onsiders al uli with arbitrary redu tion semanti s of three simple lasses, rstly ground term rewriting, then le...
متن کاملDeriving Weak Bisimulation Congruences from Reduction Systems
The focus of process calculi is interaction rather than computation, and for this very reason: (i) their operational semantics is conveniently expressed by labelled transition systems (LTSs) whose labels model the possible interactions of a process with the environment; (ii) their abstract semantics is conveniently expressed by observational congruences. However, many current-day process calcul...
متن کاملDeriving Bisimulation Congruences for Reactive Systems
General rights Copyright for the publications made accessible via the Edinburgh Research Explorer is retained by the author(s) and / or other copyright owners and it is a condition of accessing these publications that users recognise and abide by the legal requirements associated with these rights. Take down policy The University of Edinburgh has made every reasonable effort to ensure that Edin...
متن کاملDeriving Bisimulation Congruences with Borrowed Contexts (Abstract)
In the last few years the problem of deriving labelled transitions and bisimulation congruences from unlabelled reaction or rewriting rules has received great attention. This line of research was motivated by the theory of bisimulation congruences for process calculi, such as the π-calculus [19, 14]. A bisimilarity defined on unlabelled reduction rules is usually not a congruence, that is, it i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2002
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(00)00309-1